Tree Representations via Ordinal Machines
نویسندگان
چکیده
منابع مشابه
Tree Representations via Ordinal Machines
We study sets of reals computable by ordinal Turing machines with a tape of length the ordinals that are steered by a standard Turing program. The machines halt at some ordinal time or diverge. We construct tree representations for ordinal semidecidable sets of reals from ordinal computations. The aim is to generalize uniformization results to classes of sets which are semi-decidable by computa...
متن کاملLearning deep representations via extreme learning machines
Extreme learning machine (ELM) as an emerging technology has achieved exceptional performance in large-scale settings, and is well suited to binary and multi-class classification, as well as regression tasks. However, existing ELM and its variants predominantly employ single hidden layer feedforward networks, leaving the popular and potentially powerful stacked generalization principle unexploi...
متن کاملSuccinct Representations of Ordinal Trees
We survey succinct representations of ordinal, or rooted, ordered trees. Succinct representations use space that is close to the appropriate information-theoretic minimum, but support operations on the tree rapidly, usually in O(1) time.
متن کاملOrdinal machines and admissible recursion theory
We generalize standard Turing machines working in time ω on a tape of length ω to abstract machines with time α and tape length α, for α some limit ordinal. This model of computation determines an associated computability theory: α-computability theory. We compare the new theory to α-recursion theory, which was developed by G. Sacks and his school. For α an admissible ordinal, the basic notions...
متن کاملPost's Problem for Ordinal Register Machines
We study Post’s Problem for the ordinal register machines defined in [6], showing that its general solution is positive, but that any set of ordinals solving it must be unbounded in the writable ordinals. This mirrors the results in [3] for infinite-time Turing machines, and also provides insight into the different methods required for register machines and Turing machines in infinite time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computability
سال: 2012
ISSN: 2211-3568
DOI: 10.3233/com-2012-002